Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertaken by the message, subject to the place of event, remains unattended. To address this problem, we employ communication backbones (Prim’s algorithm and breadth first search (BFS)) and compute reliability based on the availability of paths for consistent message delivery from the place of event to the sink location in event driven wireless sensor networks. Our article analyses the communication reliability of a wireless sensor network in context to a topology governed by random and deterministic deployment methods. To comprehend the effect of topology on the communication reliability of a wireless network; “the within communication radii” constraint is satisfied. ANOVA is performed to validate the effect of node placement schemes on the reliability subject to varying radio ranges. It is observed that a ‘quasi’ random placement of nodes increases the communication reliability of the existing algorithms employed for analysis.